Angewandte Mathematik Und Informatik Universit at Zu K Oln on the Sqap-polytope on the Sqap-polytope

The study of the QAP-Polytope was started by Rijal (1995), Padberg and Rijal (1996), and J unger and Kaibel (1996), investigating the structure of the feasible points of a (Mixed) Integer Linear Programming formulation of the QAP that provides good lower bounds by its continious relaxation. Rijal (1995) and Padberg and Rijal (1996) propose an alternative (Mixed) Integer Linear Programming formulation for the case that the QAP-instance is symmetric in a certain sense and deene analogously the SQAP-Polytope. They give a conjecture about the dimension of that polytope, whose proof is one part of this paper. Moreover, we investigate the trivial faces of the SQAP-Polytope and present a rst class of non-trivial facets of it. The polyhedral results are used to compute lower bounds for symmetric QAPs.